Proving expected sensitivity of probabilistic programs

Proving Termination of Probabilistic Programs Using Patterns

Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with probability one (“almostsure termination”), is an equally important property for randomized algorithms and probabilistic protocols. We suggest a novel algorith...

Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs

This paper presents a wp–style calculus for obtaining bounds on the expected run–time of probabilistic programs. Its application includes determining the (possibly infinite) expected termination time of a probabilistic program and proving positive almost–sure termination— does a program terminate with probability one in finite expected time? We provide several proof rules for bounding the run–t...

Formalising Semantics for Expected Running Time of Probabilistic Programs

NQTHM proving sequential programs

Proving Termination of Prolog Programs